Knowledge-based Multi-site Coordination and Scheduling 1. the Multi-site Scheduling Problem

نویسندگان

  • Ralf Bruns
  • Jürgen Sauer
چکیده

In recent years, an increasing interest in the use of artificial intelligence techniques in the area of industrial production planning and scheduling could be observed. Most of the developed systems addressed the problem of scheduling the production activities of a single plant. However, within many industrial enterprises the production processes are distributed over several manufacturing sites, which are responsible for the production of various parts of a set of final products. In this paper the distributed knowledge-based scheduling system MUST (Multi-Site Coordination and Scheduling System) is presented which supports the human experts in the management of the dynamic distributed manufacturing environment, in particular in the scheduling of the appropriate distribution of the orders to the different manufacturing plants as well as in the coordination of the decentralized scheduling activities for all plants within one enterprise. Scheduling problems are usually treated in a single plant environment where a set of orders for products has to scheduled on a set of machines. However, within many industrial enterprises the production processes are distributed over several manufacturing sites, which are responsible for the production of various parts of a set of final products. This problem scenario is true especially for the industrial partners in the EUREKA-project PROTOS [1]. Although the multi-site scheduling problem can be defined similarly to a classical job-shop scheduling problem, several specific problem features caused by the distribution of the production have to be taken into account during scheduling: a) The existence of complex interdependencies between the production processes performed in different plants, e.g. • time dependencies between products and intermediates, e.g. a certain intermediate manufactured in plant A is needed by plant B, • the same item can be manufactured in several sites (possibly with different costs), • the exchange of items between different sites requires transportation capacities and is time-and cost-intensive, • the same raw materials in warehouses may be requested by different plants. b) The type of information used for scheduling. On the global level most of the information is cumulative and not precise, e.g. • capacity information is cumulated for machine groups, not for single machines, • durations for the manufacturing of products respectively intermediates are often estimated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and solving multi-site scheduling problems

Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of the other sites to manufacture the products of the enterprise, e.g. in car or airplane manufacturing. In the multi site-scheduling scenario we differentiate between a global and a local scheduling level. On the global level a glo...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A Hybrid Modeling for Continuous Casting Scheduling Problem

This paper deals with a multi-agent-based interval type-2 fuzzy (IT2F) expert systemfor scheduling steel continuous casting. Continuous caster scheduling is a complex and extensiveprocess that needs expert staff. In this study, a distributed multi-agent-based structure is proposed as asolution. The agents used herein can cooperate with each other via various communication protocols.To facilitat...

متن کامل

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995